Watch Teju sort arrays using Bubble, Selection, and Insertion Sort
Hi again! 👋 Today we’re learning three classic sorting algorithms:
Bubble Sort → Repeatedly swap adjacent elements
Selection Sort → Find minimum and place it in position
Insertion Sort → Build sorted portion one by one
Largest elements "bubble up" to the end in each pass!
64 > 34 → Swap! Largest numbers rise to the top
Time: O(n²) | Best: O(n) when already sorted | Space: O(1)
In each pass, find the smallest element and swap it into place!
Scanning for minimum → 25 is smallest → swap with first unsorted
Time: Always O(n²) | Space: O(1) | Fewer swaps than Bubble!
Build a sorted portion on the left — insert new card in correct position!
Take 34 → shift larger elements → insert in correct spot
Best Case: O(n) nearly sorted | Worst: O(n²) | Great for small or nearly sorted data!
| Algorithm | Time (Worst) | Time (Best) | Space | Stable? | Best For |
|---|---|---|---|---|---|
| Bubble Sort | O(n²) | O(n) | O(1) | Yes | Educational |
| Selection Sort | O(n²) | O(n²) | O(1) | No | Fewer swaps needed |
| Insertion Sort | O(n²) | O(n) | O(1) | Yes | Small or nearly sorted arrays |
Insertion Sort is usually the best among these three for real-world small/nearly-sorted data!